Waiting times of the Multiple Priority Dual Queue with Finite Buffer and Non- Preemptive Priority Scheduling

This paper considers a novel queueing model called the Multi-Priority Dual Queue (MPDQ), which was introduced and analyzed in Bedford and Zeephongsekul [1, 2]. The MPDQ consists of two queues with a finite buffer, the primary and the secondary queue with the additional feature of a priority scheme to assist with congestion control and meeting Quality of Service ( ) QoS objectives for differentiated classes of customers. In this paper, it is assumed that the service discipline is non-preemptive whereas the model in the cited paper assumes a preemptive service discipline. Using some key ideas in Zeephongsekul and Bedford [13], we give a detailed analysis of the waiting time for each class of customers with numerical examples to illustrate the results.